An Adaptive Weighted Sum Test for Family-Based Multi-Marker Association Studies

نویسندگان

  • Renfang Jiang
  • Jianping Dong
  • Yilin Dai
چکیده

Backgrounds: Although many disease-associated common variants have been discovered through genome-wide association studies, much of the genetic effects of complex diseases have not been explained. Population-based association studies are vulnerable to population stratification. A possible solution is to use family-based tests. However, if tests only estimate the genetic effect from the within-family variation to avoid population stratification, they may ignore the useful genetic information from between-family variation and lose power. Methods: We have developed an adaptive weighted sum test for family-based association studies. The new test uses data driven weights to combine two test statistics, and the weights measure the strength of population stratification. When population stratification is strong, the proposed test will automatically put more weight on one statistic derived from within-family variation to maintain robustness against spurious positives. On the other hand, when the effect of population stratification is relatively weak, the proposed test will automatically put more weight on the other statistic derived from both within-family and between-family variation to make use of both sources of genetic variation; and at the same time, the degrees of freedom of the test will be reduced and power of the test will be increased. Results: In our study, the proposed method achieves a higher power in most scenarios of linkage disequilibrium structure as well as Hap Map data from different genes under different population structures while still keeping its robustness against population stratification.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

متن کامل

A New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm

This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...

متن کامل

Adaptive tests for detecting gene-gene and gene-environment interactions.

There has been an increasing interest in detecting gene-gene and gene-environment interactions in genetic association studies. A major statistical challenge is how to deal with a large number of parameters measuring possible interaction effects, which leads to reduced power of any statistical test due to a large number of degrees of freedom or high cost of adjustment for multiple testing. Hence...

متن کامل

Adaptive Weighted Sum Method for Multiobjective Optimization

This paper presents an adaptive weighted sum method for multiobjective optimization problems. The authors developed the bi-objective adaptive weighted sum method, which determines uniformly-spaced Pareto optimal solutions, finds solutions on non-convex regions, and neglects non-Pareto optimal solutions. However, the method could solve only problems with two objective functions. In this work, th...

متن کامل

A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016